Edge Deletion Preserving the Diameter of the Hypercube
نویسندگان
چکیده
We give upper and lower bounds to the number un(Q.) of edges that one can remove from a hypercube without altering its diameter, namely: (n 2) 2”-’ ( ( Ln;2,) ) + 2 < un( Qn) < (n 2)2”_’ + 1 [(2” 1)/(2nl)].
منابع مشابه
Multiple Reduced Hypercube(MRH): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube
In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter x degree). In addit...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملDetecting tampering in a random hypercube
Consider the random hypercube H 2 (pn) obtained from the hypercube H n 2 by deleting any given edge with probabilty 1− pn, independently of all the other edges. A diameter path in H 2 is a longest geodesic path in H n 2 . Consider the following two ways of tampering with the random graph H 2 (pn): (i) choose a diameter path at random and adjoin all of its edges to H 2 (pn); (ii) choose a diamet...
متن کاملConstructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The ndimensional locally twisted cube, denoted by LTQn, an important variation of the hypercube, has the same number of nodes and the same number of connections per node as Qn. One advantage of LTQn is that the diameter is only about half of the diam...
متن کاملData Communication and Parallel Computing on Twisted Hypercubes
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for interconnecting the processors of distributed computing systems. The hypercube topology has drawn considerable attention due to many of its attractive properties. The appealing properties of the hypercube topology such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 63 شماره
صفحات -
تاریخ انتشار 1995